An Efficient Processing of Join Queries for Sensor Networks Using Column-Oriented Databases
نویسندگان
چکیده
منابع مشابه
DHTJoin: Processing Continous Join Queries using DHT Networks
This paper addresses the problem of computing approximate answers to continuous join queries. We present a new method, called DHTJoin, which combines hash-based placement of tuples in a Distributed Hash Table (DHT) and dissemination of queries exploiting the trees formed by the underlying DHT links. DHTJoin distributes the query workload across multiple DHT nodes and provides a mechanism that a...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملOptimizing Multi-Join Stream Queries for Sensor Networks
Sensors are becoming ubiquitous, and increasingly integrated with out lives. Sensor networks are being used in a wide range of applications in fields such as military, medical, process control and manufacturing, bio-terrorism, house automation etc. In these applications streams of data that flow out of the sensors are processed, analyzed and managed. However due to the dynamic and continuous na...
متن کاملEfficient Index-based Processing of Join Queries in DHTs
Massively distributed applications require the integration of heterogeneous data from multiple sources. Peer-to-peer (P2P) is one possible network model for these distributed applications and among P2P architectures, distributed hash table (DHT) is well known for its routing performance guarantees. Under a general distributed relational data model, join query operator, an essential component to...
متن کاملEfficient Processing of Proximity Queries for Large Databases
Emerging multimedia applications require database systems to provide support for new types of objects and to process queries that may have no parallel in traditional database applications. One such important class of queries are the proximity queries that aims to retrieve objects in the database that are related by a distance metric in a way that is speciied by the query. The importance of prox...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2013
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2013/345672